Optimistic Gittins Indices

نویسندگان

چکیده

We propose a tightening sequence of optimistic approximations to the Gittins index in “Optimistic Indices.” show that use these concert with an increasing discount factor appears offer compelling alternative state-of-the-art schemes proposed for Bayesian multiarmed bandit problem. prove indices constitutes regret optimal algorithm. Perhaps more interestingly, even loosest substantial performance improvements over alternatives while incurring little no additional computational overhead relative simplest alternatives.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimistic Gittins Indices

Starting with the Thomspon sampling algorithm, recent years have seen a resurgence of interest in Bayesian algorithms for the Multi-armed Bandit (MAB) problem. These algorithms seek to exploit prior information on arm biases and while several have been shown to be regret optimal, their design has not emerged from a principled approach. In contrast, if one cared about Bayesian regret discounted ...

متن کامل

Optimal Stopping and Gittins' Indices for Piecewise Deterministic Evolution Processes

An optimal stopping problem involving a piecewise determinis-tic evolution processes is explicitly solved using the method of quasi-variational inequalities. The explicit solution derived ooer the possibility to explicitly discuss the associated dynamic allocation problems by means of the Gittins indices.

متن کامل

Explicit Gittins Indices for a Class of Superdiffusive Processes

We explicitly calculate the dynamic allocation indices (i.e. the Gittins indices) for multiarmed Bandit processes driven by superdiffusive noise sources. This class of model generalizes former results derived by Karatzas for diffusive processes. In particular, the Gittins indices do, in this soluble class of superdiffusive models, explicitly depend on the noise state.

متن کامل

Distributed Optimistic Concurrency Considered Optimistic

Optimistic concurrency relies on speculative execution, read-write conflict detection, and checkpointrollback techniques to provide a programming model that replaces locks with the abstraction of atomic, isolated execution of critical sections. Previous research has shown that on chip multi-processors, a class of workloads featuring irregular parallelism and rare read-write conflicts can reap s...

متن کامل

Optimal decision indices for R&D project evaluation in the pharmaceutical industry: Pearson index versus Gittins index

This paper examines issues related to various decision-based analytic approaches to sequential choice of projects, with special motivation from and application in the pharmaceutical industry. In particular, the Pearson index and Gittins index are considered as key strategic decision-making tools for the selection of R&D projects. It presents a proof of optimality of the Pearson index based on t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research

سال: 2022

ISSN: ['1526-5463', '0030-364X']

DOI: https://doi.org/10.1287/opre.2021.2207